Triangulations without pointed spanning trees
نویسندگان
چکیده
Problem 50 in the Open Problems Project of the computational geometry community asks whether any triangulation on a point set in the plane contains a pointed spanning tree as a subgraph. We provide a counterexample. As a consequence we show that there exist triangulations which require a linear number of edge flips to become Hamiltonian.
منابع مشابه
Transforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T ′ of TS are adjacent if T intersects T ′ only in points of S or in common edges. We prove that the diameter of TS is O(log k), where k denotes the number of convex layers of S. Based on this result, we show that the flip graph PS of pseudo-triangulations...
متن کاملA QPTAS for the base of the number of crossing-free structures on a planar point set
The number of triangulations of a planar n point set S is known to be c, where the base c lies between 8.65 and 30. Similarly, the number of spanning trees on S is known to be d, where the base d lies between 12.52 and 141.07. The fastest known algorithm for counting triangulations of S runs in O∗(2n) time while that for counting spanning trees on S enumerates them in Ω(12.52) time. The fastest...
متن کاملExpansive Motions and the Polytope of Pointed Pseudo-Triangulations
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its 1-skeleton is the graph whose vertices are the pointed pseudo-triangulations of the point set and whose edges are flips of interior pseudo-triangulation edges. For p...
متن کاملTriangulating the Square and Squaring the Triangle : 1 Quadtrees and Delaunay Triangulations are Equivalent
4 We show that Delaunay triangulations and compressed quadtrees are equivalent structures. More precisely, 5 we give two algorithms: the first computes a compressed quadtree for a planar point set, given the Delaunay 6 triangulation; the second finds the Delaunay triangulation, given a compressed quadtree. Both algorithms 7 run in deterministic linear time on a pointer machine. Our work builds ...
متن کاملComputational Geometry
This column is devoted to non-crossing configurations in the plane realized with straight line segments connecting pairs of points from a finite ground set. Graph classes of interest realized in this way include matchings, spanning trees, spanning cycles, and triangulations. We review some problems and results in this area. At the end we list some open problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 40 شماره
صفحات -
تاریخ انتشار 2008